The Euclidean Steiner Tree Problem
نویسنده
چکیده
The Euclidean Steiner tree problem is solved by finding the tree with minimal Euclidean length spanning a set of fixed vertices in the plane, while allowing for the addition of auxiliary vertices (Steiner vertices). Steiner trees are widely used to design real-world structures like highways and oil pipelines. Unfortunately, the Euclidean Steiner Tree Problem has shown to be NP-Hard, meaning there are no currently known polynomial time algorithms. This paper presents a brief history of the problem and discusses two techniques for finding Euclidean Steiner trees.
منابع مشابه
On the History of the Euclidean Steiner Tree Problem
The history of the Euclidean Steiner tree problem, which is the problem of constructing a shortest possible network interconnecting a set of given points in the Euclidean plane, goes back to Gergonne in the early 19th century. We present a detailed account of the mathematical contributions of some of the earliest papers on the Euclidean Steiner tree problem. Furthermore, we link these initial c...
متن کاملTwo Heuristics for the Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an efficient method for computing a locally optimal tree with a given topol...
متن کاملFast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem
Bottleneck Steiner tree problem asks to find a Steiner tree for n terminals with at most k Steiner points such that the length of the longest edge in the tree is minimized. The problem has applications in the design of wireless communication networks. In this paper we study a restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Stein...
متن کاملBetter approximation bounds for the network and Euclidean Steiner tree problems
The network and Euclidean Steiner tree problems require a shortest tree spanning a given vertex subset within a network G = (V; E; d) and Euclidean plane, respectively. For these problems, we present a series of heuristics nding approximate Steiner tree with performance guarantee coming arbitrary close to 1+ln2 1:693 and 1+ln 2 p 3 1:1438, respectively. The best previously known corresponding v...
متن کاملEuclidean Pawel Winter 187 trees visibility
The notion of Steiner visibility graphs is introduced. Their applicability in connection with the construction of good quality suboptimal solutions to the Euclidean Steiner tree problem with obstacles is discussed. Polynomial algorithms generating Steiner visibility graphs are described.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004